First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words
نویسندگان
چکیده
We contribute to the refined understanding of language-logic-algebra interplay in context first-order properties countable words. establish decidable algebraic characterizations one variable fragment FO as well boolean closure existential via a strengthening Simon’s theorem about piecewise testable languages. propose new extension which admits infinitary quantifiers reason inherent provide very natural and hierarchical block-product based characterization extension. also explicate its role view other classical logical systems such WMSO FO[cut] - an where quantification over Dedekind-cuts is allowed. rule out possibility finite-basis for these systems. Finally, we report simple but novel fragments hierarchies proposed FO.
منابع مشابه
A The Tale of the Quantifier Alternation Hierarchy of First-Order Logic over Words
In other words, we ask whether the input language belongs to the class of languages defined by the logic, hence the name of the problem: the F-membership problem. Having an F-membership algorithm in hand amounts to having an effective description of all regular properties that F can express. This is why obtaining a membership algorithm is viewed as the goal to strive for when trying to get a pr...
متن کاملTwo-variable first order logic with modular predicates over words
We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol < (interpreted as a linear order) and the set MOD of modular numerical predicates. We study the expressive power of FO2[<,MOD], the two-variable first order logic over this signature, interpreted over finite words. We give an algebraic characterization of the corresponding regular languages...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملGoing Higher in First-Order Quantifier Alternation Hierarchies on Words
We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language in the levels $\mathcal{B}{\Sigma}_2$ (finite boolean combinations of formulas having only one alternation) and ${\Sigma}_3$ (formulas having on...
متن کاملA note on extensions of infinitary logic
We show that a strong form of the so called Lindström’s Theorem [4] fails to generalize to extensions of Lκω and Lκκ: For weakly compact κ there is no strongest extension of Lκω with the (κ, κ)compactness property and the Löwenheim-Skolem theorem down to κ. With an additional set-theoretic assumption, there is no strongest extension of Lκκ with the (κ, κ)-compactness property and the LöwenheimS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86593-1_3